Allocation and scheduling of Conditional Task Graphs
نویسندگان
چکیده
منابع مشابه
Allocation and scheduling of Conditional Task Graphs
We propose an original, complete and efficient approach to the allocation and scheduling of Conditional Task Graphs (CTGs). In CTGs, nodes represent activities, some of them are branches and are labeled with a condition, arcs rooted in branch nodes are labeled with condition outcomes and a corresponding probability. A task is executed at run time if the condition outcomes that label the arcs in...
متن کاملStochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph characterizing a target application and a target architecture with alternative memory and computation resources, we compute an allocation and schedule minimizing the expected value of communication cost, being the communica...
متن کاملStochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip
Embedded systems designers are turning to multicore architectures to satisfy the ever-growing computational needs of applications within a reasonable power envelope. One of the most daunting challenges for MultiProcessor System-on-Chip (MPSoC) platforms is the development of tools for efficient mapping multi-task applications onto hardware platforms. Software mapping can be formulated as an opt...
متن کاملStochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs Techical report
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph characterizing a target application and a target architecture with alternative memory and computation resources, we compute an allocation and schedule minimizing the expected value of communication cost, being the communica...
متن کاملInto The Conditional Task Scheduling
One of critical issues aaecting parallel system performance is the scheduling of tasks onto available target processors. A great number of algorithms and software tools have been presented to deal with the task scheduling problem in parallel processing. In this paper, we study a general (less-restricted) scheduling case, named \conditional task scheduling", in which the task model of each progr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2010
ISSN: 0004-3702
DOI: 10.1016/j.artint.2010.02.004